cient Insertion and Retrieval
نویسندگان
چکیده
Allowing for content-based image retrieval, an image database must perform a number of time-consuming feature extraction tasks when inserting a new image, when searching with a newly entered image, or when bulk-loading many images in parallel. The duration of this preprocessing step typically lies far beyond what one would accept for conventional (short-running) database transactions. Hence, a natural step is to export the extraction tasks from the database and to distribute them among a number of external components in a cluster. As a consequence the database plays the role of a coordinator that assigns tasks to "its" auxiliary components. Since the execution times for feature extraction and the availabilities of such components vary over time, the coordinator needs additional information about the components in order to "optimally" assign extraction tasks to available components such that the overall preprocessing cost is minimized. At the same time, similarity search should be supported with high priority. In this paper, we present a coordination middleware (CoMid) on top of a distributed, component-based architecture that minimizes the cost of the preprocessing step and optimally assigns extraction tasks. We provide a solution for a dynamic environment: Any time a new feature extraction component can be added and any time a component can be switched oo. Insertions as well as searches will not need to be restarted. The coordination middleware takes care of such "failures" and initiates "forward recovery". We describe in detail what data on the components and what image meta-data are necessary for the coordination, and how to exploit them. We report on an evaluation of this architecture using our prototype system applied to a very large image collection.
منابع مشابه
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques for text retrieval are well understood, e cient and robust indexing methodology for image retrieval is still in its infancy. In this paper, we present a non-hierarchical clustering scheme for index generation using the...
متن کاملAn Efficient Conflict-Resolution Approach to Support Read/Write Operations in a Video Server
In this paper we propose an e cient conflict resolution approach based on the multi disk architecture for the insertion deletion operations on continuous media that are split up into blocks and placed in various locations on the disk without reorganizing the whole data When a new subobject is inserted after subobject i it will be assigned with an identi cation number i and be inserted to a disk...
متن کاملO-39: Ultrasound Deformable Model for Virtual Surgery Simulation of Oocyte Retrieval in Infertility Programs
Background The use of a medical simulator should enhance the goals of minimally invasive surgery: patient safety, cosmesis, shortening the length of hospital admissions, and reducing cost. Using an innovative approach to the handling of ultrasound images in virtual reality simulation, this article describes a process that employs a hybrid model of deformable models that can be applied in the te...
متن کاملThesaurus - based E cient Example Retrieval by Generating Retrieval Queries from Similarities
In example-based NLP, the problem of computational cost of example retrieval is severe, since the retrieval time increases in proportion to the number of examples in the database. This paper proposes a novel example retrieval method for avoiding full retrieval of examples. The proposed method has the following three features, 1) it generates retrieval queries from similarities, 2) ef-cient exam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999